Load Dispatch Method using Fractional Programming and Semi-definite Programming
نویسندگان
چکیده
منابع مشابه
Economic-emission dispatch problem: A semi-definite programming approach
A semi-definite programming (SDP) formulation of the multi-objective economic-emission dispatch problem is presented. The fuel cost and emission functions are represented by high order polynomial functions and this was shown to be a more accurate representation of the economic-emission dispatch (EED) problem. Furthermore, the polynomial functions of both objective functions are aggregated into ...
متن کاملAn iterative method for tri-level quadratic fractional programming problems using fuzzy goal programming approach
Tri-level optimization problems are optimization problems with three nested hierarchical structures, where in most cases conflicting objectives are set at each level of hierarchy. Such problems are common in management, engineering designs and in decision making situations in general, and are known to be strongly NP-hard. Existing solution methods lack universality in solving these types of pro...
متن کاملGraph Partitioning and Semi-definite Programming Hierarchies
Graph partitioning is a fundamental optimization problem that has been intensively studied. Many graph partitioning formulations are important as building blocks for divide-and-conquer algorithms on graphs as well as to many applications such as VLSI layout, packet routing in distributed networks, clustering and image segmentation. Unfortunately such problems are notorious for the huge gap betw...
متن کاملBest separable approximation with semi-definite programming method
The present methods for obtaining the optimal LewenesteinSanpera decomposition of a mixed state are difficult to handle analytically. We provide a simple analytical expression for the optimal Lewenstein-Sanpera decomposition by using semidefinite programming. Specially, we obtain the optimal Lewenstein-Sanpera decomposition for some examples such as: Bell decomposable state, Iso-concurrence sta...
متن کاملA logarithm barrier method for semi-definite programming
This paper presents a logarithmic barrier method for solving a semi-definite linear program. The descent direction is the classical Newton direction. We propose alternative ways to determine the step-size along the direction which are more efficient than classical linesearches.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEJ Transactions on Electronics, Information and Systems
سال: 2000
ISSN: 0385-4221,1348-8155
DOI: 10.1541/ieejeiss1987.120.8-9_1272